Topological factors of rank-one subshifts

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

-algebras of Tracial Topological Rank One *

We give a classification theorem for unital separable nuclear simple C∗-algebras with tracial rank no more than one. Let A and B be two unital separable simple nuclear C∗-algebras with TR(A), TR(B) ≤ 1 which satisfy the universal coefficient theorem. We show that A ∼= B if and only if there is an order and unit preserving isomorphism γ = (γ0, γ1, γ2) : (K0(A),K0(A)+, [1A],K1(A), T (A)) ∼= (K0(B...

متن کامل

Minimal Subshifts of Arbitrary Mean Topological Dimension

Let G be a countable infinite amenable group and P be a polyhedron. We give a construction of minimal subshifts of P with arbitrarily mean topological dimension less than dimP .

متن کامل

Topological Full Groups of Minimal Subshifts and Just-infinite Groups

In [24], confirming a conjecture of Hjorth-Kechris [16], Thomas-Velickovic proved that the isomorphism relation on the space Gfg of finitely generated groups is a universal countable Borel equivalence relation. (Here Gfg denotes the Polish space of finitely generated groups introduced by Grigorchuk [12]; i.e. the elements of Gfg are the isomorphism types of marked groups (G, c ), where G is a f...

متن کامل

The Complexity of the Topological Conjugacy Problem for Toeplitz Subshifts

In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show that the topological conjugacy relation is hyperfinite on a larger class of Toeplitz subshifts which we call Toeplitz subshifts with growing blocks. This resul...

متن کامل

On the Computability of the Topological Entropy of Subshifts

We prove that the topological entropy of subshifts having decidable language is uncomputable in the following sense: For no error bound less than 1/4 does there exists a program that, given a decision procedure for the language of a subshift as input, will approximate the entropy of the subshift within the error bound. In addition, we prove that not only is the topological entropy of sofic shif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society, Series B

سال: 2020

ISSN: 2330-1511

DOI: 10.1090/bproc/55